Menu

Filtros : "Skokan, Jozef" Limpar

Filtros

Refine with date range

  • 1

1 - 5 (5 records)

  • Parte de monografia/livro

    On the triangle removal lemma for subgraphs of sparse pseudorandom graphs (2010)

    Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Schacht, Mathias; Skokan, Jozef

    Source: An irregular mind. Unidade: IME

    Subjects: MÉTODOS PROBABILÍSTICOS, TEORIA DOS GRAFOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      KOHAYAKAWA, Yoshiharu et al. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. An irregular mind. Tradução . Berlin: Springer, 2010. . Disponível em: https://doi.org/10.1007/978-3-642-14444-8_10. Acesso em: 27 abr. 2024.

    • APA

      Kohayakawa, Y., RÖdlt, V. Ě., Schacht, M., & Skokan, J. (2010). On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. In An irregular mind. Berlin: Springer. doi:10.1007/978-3-642-14444-8_10

    • NLM

      Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10

    • Vancouver

      Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10

  • Artigo de periodico

    Turan's theorem for pseudo-random graphs (2007)

    Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias; Sissokho, Papa; Skokan, Jozef

    Source: Journal of Combinatorial Theory, Serie A. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      KOHAYAKAWA, Yoshiharu et al. Turan's theorem for pseudo-random graphs. Journal of Combinatorial Theory, Serie A, v. 114, n. 4, p. 631-657, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.jcta.2006.08.004. Acesso em: 27 abr. 2024.

    • APA

      Kohayakawa, Y., Rodl, V., Schacht, M., Sissokho, P., & Skokan, J. (2007). Turan's theorem for pseudo-random graphs. Journal of Combinatorial Theory, Serie A, 114( 4), 631-657. doi:10.1016/j.jcta.2006.08.004

    • NLM

      Kohayakawa Y, Rodl V, Schacht M, Sissokho P, Skokan J. Turan's theorem for pseudo-random graphs [Internet]. Journal of Combinatorial Theory, Serie A. 2007 ; 114( 4): 631-657.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.jcta.2006.08.004

    • Vancouver

      Kohayakawa Y, Rodl V, Schacht M, Sissokho P, Skokan J. Turan's theorem for pseudo-random graphs [Internet]. Journal of Combinatorial Theory, Serie A. 2007 ; 114( 4): 631-657.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.jcta.2006.08.004

  • Artigo de periodico

    The hypergraph regularity method and its applications (2005)

    Rodl, Vojtech; Nagle, Brendan; Skokan, Jozef; Schatcht, M.; Kohayakawa, Yoshiharu

    Source: Proceedings of the National Academy of Sciences of the United States of America. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      RODL, Vojtech et al. The hypergraph regularity method and its applications. Proceedings of the National Academy of Sciences of the United States of America, v. 102, n. 23, p. 8109-8113, 2005Tradução . . Disponível em: https://doi.org/10.1073/pnas.0502771102. Acesso em: 27 abr. 2024.

    • APA

      Rodl, V., Nagle, B., Skokan, J., Schatcht, M., & Kohayakawa, Y. (2005). The hypergraph regularity method and its applications. Proceedings of the National Academy of Sciences of the United States of America, 102( 23), 8109-8113. doi:10.1073/pnas.0502771102

    • NLM

      Rodl V, Nagle B, Skokan J, Schatcht M, Kohayakawa Y. The hypergraph regularity method and its applications [Internet]. Proceedings of the National Academy of Sciences of the United States of America. 2005 ; 102( 23): 8109-8113.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1073/pnas.0502771102

    • Vancouver

      Rodl V, Nagle B, Skokan J, Schatcht M, Kohayakawa Y. The hypergraph regularity method and its applications [Internet]. Proceedings of the National Academy of Sciences of the United States of America. 2005 ; 102( 23): 8109-8113.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1073/pnas.0502771102

  • Trabalho de evento-anais periodico

    The 3-colored Ramsey number of odd cycles (2005)

    Kohayakawa, Yoshiharu ; Simonovits, Maklós; Skokan, Jozef

    Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME

    Assunto: COMBINATÓRIA

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      KOHAYAKAWA, Yoshiharu e SIMONOVITS, Maklós e SKOKAN, Jozef. The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2005.05.053. Acesso em: 27 abr. 2024. , 2005

    • APA

      Kohayakawa, Y., Simonovits, M., & Skokan, J. (2005). The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2005.05.053

    • NLM

      Kohayakawa Y, Simonovits M, Skokan J. The 3-colored Ramsey number of odd cycles [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 397-402.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.endm.2005.05.053

    • Vancouver

      Kohayakawa Y, Simonovits M, Skokan J. The 3-colored Ramsey number of odd cycles [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 397-402.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1016/j.endm.2005.05.053

  • Artigo de periodico

    Hypergraphs, quasi-randomness, and conditions for regularity (2002)

    Kohayakawa, Yoshiharu ; Rodl, Vojtech; Skokan, Jozef

    Source: Journal of Combinatorial Theory. Ser. A. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Versão PublicadaAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      KOHAYAKAWA, Yoshiharu e RODL, Vojtech e SKOKAN, Jozef. Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory. Ser. A, v. 97, n. 2, p. 307-352, 2002Tradução . . Disponível em: https://doi.org/10.1006/jcta.2001.3217. Acesso em: 27 abr. 2024.

    • APA

      Kohayakawa, Y., Rodl, V., & Skokan, J. (2002). Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory. Ser. A, 97( 2), 307-352. doi:10.1006/jcta.2001.3217

    • NLM

      Kohayakawa Y, Rodl V, Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity [Internet]. Journal of Combinatorial Theory. Ser. A. 2002 ; 97( 2): 307-352.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1006/jcta.2001.3217

    • Vancouver

      Kohayakawa Y, Rodl V, Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity [Internet]. Journal of Combinatorial Theory. Ser. A. 2002 ; 97( 2): 307-352.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1006/jcta.2001.3217
  • 1

1 - 5 (5 records)

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024